The Dating Problem and Optimal Ordering of Sequential Opportunities
نویسندگان
چکیده
منابع مشابه
The Dating Problem and Optimal Ordering of Sequential Opportunities
In this paper, we discuss a stochastic decision problem of optimally selecting the order in which to try n opportunities that may yield an uncertain reward in the future. The motivation came out from pure curiosity, after an informal conversation about what could be the best way to date friends. The problem structure turned out to be suitable also for other situations, such as the problem of op...
متن کاملthe problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولValid Inequalities and Separation for the Symmetric Sequential Ordering Problem
The sequential ordering problem (SOP) is the generalisation of the asymmetric TSP in which the tour must obey given precedence relations between pairs of nodes. Many solution approaches have been devised for the SOP, but the version with symmetric costs, which we call the SSOP, has received very little attention. To fill this gap, we present a new 0-1 linear programming formulation for the SSOP...
متن کاملAn Enhanced Ant Colony System for the Sequential Ordering Problem
A well-known Ant Colony System algorithm for the Sequential Ordering Problem is studied to identify its drawbacks. Some criticalities are identified, and an Enhanced Ant Colony System method that tries to overcome them, is proposed. Experimental results show that the enhanced method clearly outperforms the original algorithm and becomes a reference method for the problem under investigation.
متن کاملSolving the Sequential Ordering Problem with Automatically Generated Lower Bounds
The Sequential Ordering Problem (SOP) is a version of the Asymmetric Traveling Salesman Problem (ATSP) where precedence constraints on the vertices must also be observed. The SOP has many real life applications and it has proved to be a great challenge (there are SOPs with 40-50 vertices which have not been solved optimally yet with significant computational effort). We use novel branch&bound s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2017
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2017.08.115